Relatively pointwise recurrent graph map

Pointwise-recurrent dendrite maps

Let D be a dendrite and f : D → D a continuous map. Denote by E(D) and B(D) the sets of endpoints and branch points of D respectively. We show that if E(D) is countable (resp. B(D) is discrete) then f is pointwise-recurrent if and only if f is pointwise periodic homeomorphism (resp. every point in D\E(D) is periodic).

Component Orbits under Pointwise Recurrent Homeomorphisms

A Pointwise Approximation of Isolated Trees in a Random Graph

In this paper, we give a pointwise approximation of the number of isolated trees of order k in a random graph by Poisson distribution. The technique we used here is the Stein’s method.

Graph-based Semi-supervised Learning: Realizing Pointwise Smoothness Probabilistically

As the central notion in semi-supervised learning, smoothness is often realized on a graph representation of the data. In this paper, we study two complementary dimensions of smoothness: its pointwise nature and probabilistic modeling. While no existing graph-based work exploits them in conjunction, we encompass both in a novel framework of Probabilistic Graph-based Pointwise Smoothness (PGP), ...

The Pentagram Map is Recurrent

CONTENTS The pentagram map is defined on the space of convex n-gons